The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches

A New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm

This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...

The Weighted Independent Domination Problem: Integer Linear Programming Models and Metaheuristic Approaches

This work deals with the so-called weighted independent domination problem, which is an NP-hard combinatorial optimization problem in graphs. In contrast to previous work, this paper considers the problem from a non-theoretical perspective. The first contribution consists in the development of three integer linear programming models. Second, two greedy heuristics are proposed. Finally, the last...

The Weighted Independent Domination Problem: Integer Linear Programming Models and Metaheuristic Approaches

The Weighted Independent Domination Problem: Integer Linear Programming Models and Metaheuristic Approaches

The Weighted Independent Domination Problem: Integer Linear Programming Models and Metaheuristic Approaches